منابع مشابه
Path And Cycle Decompositions
First I want to say a few words about my graph terminology. If I want to allow loops, I use the adjective reflexive. If I want to allow multiple edges, I use multigraph. Thus, a graph has no loops and no multiple edges. I use valency rather than degree. If we say a graph is 4-valent (or tetravalent), it means it is regular of valency 4, for example. A decomposition of a graph X is a partition o...
متن کاملPath decompositions and perfect path double covers
We consider edge-decompositions of regular graphs into isomorphic paths. An m-PPD (perfect path decomposition) is a decomposition of a graph into paths of length m such that every vertex is an end of exactly two paths. An m-PPDC (perfect path double cover) is a covering of the edges by paths of length m such that every edge is covered exactly two times and every vertex is an end of exactly two ...
متن کاملPath Decompositions for Markov Chains
We present two path decompositions of Markov chains (with general state space) by means of harmonic functions, which are dual to each other. They can be seen as a generalization of Williams' decomposition of a Brownian motion with drift. The results may be illustrated by a multitude of examples, but we confine ourselves to different types of random walks and the Pólya urn. 1. Introduction and m...
متن کاملPath decompositions and Gallai's conjecture
LetG be a connected simple graph on n vertices. Gallai’s conjecture asserts that the edges ofG can be decomposed into n2 paths. Let H be the subgraph induced by the vertices of even degree in G. Lovász showed that the conjecture is true ifH contains at most one vertex. Extending Lovász’s result, Pyber proved that the conjecture is true if H is a forest. A forest can be regarded as a graph in wh...
متن کاملDirected graphs, decompositions, and spatial linkages
The decomposition of a linkage into minimal components is a central tool of analysis and synthesis of linkages. In this paper we prove that every pinned d-isostatic (minimally rigid) graph (grounded linkage) has a unique decomposition into minimal strongly connected components (in the sense of directed graphs), or equivalently intominimal pinned isostatic graphs, which we call d-Assur graphs. W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2020
ISSN: 0895-4801,1095-7146
DOI: 10.1137/19m1248728